X-Code: MDS Array Codes with Optimal Encoding
نویسندگان
چکیده
We present a new class of MDS array codes of size n n (n a prime number) called X-Code. The X-Codes are of minimum column distance 3, namely, they can correct either one column error or two column erasures. The key novelty in X-code is that it has a simple geometrical construction which achieves encoding/update optimal complexity, namely, a change of any single information bit a ects exactly two parity bits. The key idea in our constructions is that all parity symbols are placed in rows rather than columns.
منابع مشابه
Rotary-code: Efficient MDS Array Codes for RAID-6 Disk Arrays
Low encoding/decoding complexity is essential for practical RAID-6 storage systems. In this paper, we describe a new coding scheme, which we call Rotary-code, for RAID-6 disk arrays. We construct Rotarycode based on a bit matrix-vector product similar to the Reed-Solomon coding, and provide the geometry encoding method and detailed non-recursive decoding algorithms. The capability of two-disk f...
متن کاملArray Codes with Optimal Encoding
We present a new class of MDS array codes of size n n (n a prime number) called X-Code. The X-Codes are of minimum column distance 3, namely, they can correct either one column error or two column erasures. The key novelty in X-Code is that it has a simple geometrical construction which achieves encoding/update optimal complexity, i.e., a change of any single information bit a ects exactly two ...
متن کاملS-Code: Lowest Density MDS Array Codes for RAID-6
RAID, a storage architecture designed to exploit I/O parallelism and provide data reliability, has been deployed widely in computing systems as a storage building block. In large scale storage systems, in particular, RAID-6 is gradually replacing RAID-5 as the dominant form of disk arrays due to its capability of tolerating concurrent failures of any two disks. MDS (maximum distance separable) ...
متن کاملA Non-MDS Erasure Code Scheme for Storage Applications
This paper investigates the use of redundancy and self repairing against node failures indistributed storage systems using a novel non-MDS erasure code. In replication method, accessto one replication node is adequate to reconstruct a lost node, while in MDS erasure codedsystems which are optimal in terms of redundancy-reliability tradeoff, a single node failure isrepaired after recovering the ...
متن کاملA New Design of Binary MDS Array Codes with Asymptotically Weak-Optimal Repair
Binary maximum distance separable (MDS) array codes are a special class of erasure codes for distributed storage that not only provide fault tolerance with minimum storage redundancy but also achieve low computational complexity. They are constructed by encoding k information columns into r parity columns, in which each element in a column is a bit, such that any k out of the k + r columns suff...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Information Theory
دوره 45 شماره
صفحات -
تاریخ انتشار 1999